Properties of Symmetric Boolean functions

Rotation Symmetric Boolean Functions -; Count and Cryptographic Properties

In 1999, Pieprzyk and Qu presented rotation symmetric (RotS) functions as components in the rounds of hashing algorithm. Later, in 2002, Cusick and Stănică presented further advancement in this area. This class of Boolean functions are invariant under circular translation of indices. In this paper, using Burnside’s lemma, we prove that the number of n-variable rotation symmetric Boolean functio...

Generalized Rotation Symmetric and Dihedral Symmetric Boolean Functions - 9 Variable Boolean Functions with Nonlinearity 242

Recently, 9-variable Boolean functions having nonlinearity 241, which is strictly greater than the bent concatenation bound of 240, have been discovered in the class of Rotation Symmetric Boolean Functions (RSBFs) by Kavut, Maitra and Yücel. In this paper, we present several 9-variable Boolean functions having nonlinearity of 242, which we obtain by suitably generalizing the classes of RSBFs an...

Regular symmetric groups of boolean functions

is called a Boolean function. By Aut(f) we denote the set of all symmetries of f , i.e., these permutation σ ∈ Sn for which f(xσ(1), . . . , xσ(n)) = f(x1, . . . , xn). We show the solution of a problem posed by A. Kisielewicz ([1]). We show that, with the exception of four known groups of small order, every regular permutation group is isomorphic with Aut(f) for some Boolean function f . We pr...

Stochastic Evaluation of Symmetric Boolean Functions

Quadratization of Symmetric Pseudo-Boolean Functions

A pseudo-Boolean function is a real-valued function f(x) = f(x1, x2, . . . , xn) of n binary variables; that is, a mapping from {0, 1}n to R. For a pseudo-Boolean function f(x) on {0, 1}n, we say that g(x, y) is a quadratization of f if g(x, y) is a quadratic polynomial depending on x and on m auxiliary binary variables y1, y2, . . . , ym such that f(x) = min{g(x, y) : y ∈ {0, 1}m} for all x ∈ ...